/* Copyright (C) 2013-2021 TU Dortmund
 * This file is part of LearnLib, http://www.learnlib.de/.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package de.learnlib.algorithms.lstar.dfa;

import java.util.ArrayList;
import java.util.List;

import net.automatalib.words.Word;

public final class LStarDFAUtil {

    private LStarDFAUtil() {
        // prevent instantiation
    }

    public static <I> List<Word<I>> ensureSuffixCompliancy(List<Word<I>> suffixes) {
        List<Word<I>> compSuffixes = new ArrayList<>();
        compSuffixes.add(Word.epsilon());
        for (Word<I> suff : suffixes) {
            if (!suff.isEmpty()) {
                compSuffixes.add(suff);
            }
        }

        return compSuffixes;
    }
}
